The Space Complexity Analysis in the General Number Field Sieve Integer Factorization
نویسندگان
چکیده
منابع مشابه
Space Complexity Analysis of Sieving in the Number Field Sieve Integer Factorization
The general number sieve is the most efficient algorithm known integer factorization, it consists of polynomial selection, sieving, solving equations and finding square roots. In this paper, the p adic − evaluation provided by each root and the expected p − value are given, then we get the space complexity of sieving over the ring / 2 � � . Introduction In 1976, Diffie and Hellman published the...
متن کاملA Kilobit Special Number Field Sieve Factorization
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2 − 1. Although this factorization is orders of magnitude ‘easier’ than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of t...
متن کاملThe Sieve Re-Imagined: Integer Factorization Methods
In this paper, I explain the Quadratic Sieve, its Multiple Polynomial variation, the Number Field Sieve, and give some worked examples of the afore-mentioned algorithms. Using my own Maple implementation of the Quadratic Sieve, I explore the effect of altering one of the parameters of the Quadratic Sieve algorithm, with respect to both time and success rate.
متن کاملFactorization of RSA-140 Using the Number Field Sieve
On February 2, 1999, we completed the factorization of the 140–digit number RSA–140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factorization of the 130–digit number RSA–130, also with the help of NFS. The amount of computing time spent on RSA–140 was roughly twice that neede...
متن کاملThe number field sieve
We describe the main ideas underlying integer factorization using the number field sieve.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.03.028